Mining Top-K Non-redundant Association Rules
نویسندگان
چکیده
Association rule mining is a fundamental data mining task. However, depending on the choice of the thresholds, current algorithms can become very slow and generate an extremely large amount of results or generate too few results, omitting valuable information. Furthermore, it is well-known that a large proportion of association rules generated are redundant. In previous works, these two problems have been addressed separately. In this paper, we address both of them at the same time by proposing an approximate algorithm named TNR for mining top-k non redundant association rules.
منابع مشابه
MARBLES: Mining Association Rules Buried in Long Event Sequences
Sequential pattern discovery is a well-studied field in data mining. Episodes are sequential patterns that describe events that often occur in the vicinity of each other. Episodes can impose restrictions on the order of the events, which makes them a versatile technique for describing complex patterns in the sequence. Most of the research on episodes deals with special cases such as serial and ...
متن کاملMining Condensed Non-Redundant Level-Crossing Approximate Association Rules
In association rule mining one intractable problem is the huge number of the extracted rules, especially, in the case of level-crossing association rules. In this paper, aiming at the redundancy produced during level-crossing association rules mining, an approach for eliminating level-crossing approximate redundant rules is proposed. In the method, the redundancies are divided combination with ...
متن کاملDiscovering Non-Redundant Association Rules using MinMax Approximation Rules
Dept. Of Comp. Sci. & Eng. Vaagdevi college of Eng. Warangal, India [email protected] Abstract Frequent pattern mining is an important area of data mining used to generate the Association Rules. The extracted Frequent Patterns quality is a big concern, as it generates huge sets of rules and many of them are redundant. Mining Non-Redundant Frequent patterns is a big concern in the area of Ass...
متن کاملA lattice-based approach for mining most generalization association rules
Traditional association rules consist of some redundant information. Some variants based on support and confidence measures such as non-redundant rules and minimal non-redundant rules were thus proposed to reduce the redundant information. In the past, we proposed most generalization association rules (MGARs), which were more compact than (minimal) non-redundant rules in that they considered th...
متن کاملConcise Representations for Association Rules in Multi-level Datasets
Association rule mining plays an important role in knowledge and information discovery. Often for a dataset, a huge number of rules can be extracted, but many of them are redundant, especially in the case of multi-level datasets. Mining non-redundant rules is a promising approach to solve this problem. However, existing work (Pasquier et al. 2005, Xu & Li 2007) is only focused on single level d...
متن کامل